<?php
/**
 * @title 2415. 反转二叉树的奇数层
 * @author start2004
 */

// ini_set("memory_limit", "128M");

// class Solution {
//
//     function find() {
//
//     }
// }

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     public $val = null;
 *     public $left = null;
 *     public $right = null;
 *     function __construct($val = 0, $left = null, $right = null) {
 *         $this->val = $val;
 *         $this->left = $left;
 *         $this->right = $right;
 *     }
 * }
 */
class Solution {

    /**
     * @param TreeNode $root
     * @return TreeNode
     */
    function reverseOddLevels($root) {
        /**
         * @since 2023-12-15 节点深度
         */
        $depth = 0;
        
        /**
         * @since 2023-12-15 层次遍历
         */
        $nodeArray = [$root];
        while($nodeArray){
            /**
             * @since 2023-12-15 下次遍历
             */
            $nextNodeArray = [];

            /**
             * @since 2023-12-15 遍历当层节点
             */
            $valArray = [];
            foreach ($nodeArray as $node){
                /**
                 * @since 2023-12-15 节点值
                 */
                $valArray[] = $node->val;

                /**
                 * @since 2023-12-15 子节点
                 */
                if($node->left !== null){
                    $nextNodeArray[] = $node->left;
                    $nextNodeArray[] = $node->right;
                } else {}
            }

            /**
             * @since 2023-12-15 奇数层
             */
            if($depth%2==1){
                /**
                 * @since 2023-12-15 反转节点值
                 */
                $nodeCnt = count($nodeArray);
                for($i=0, $j=$nodeCnt-1; $i<$nodeCnt; $i++, $j--){
                    $nodeArray[$i]->val = $valArray[$j];
                }
            } else {}

            /**
             * @since 2023-12-15 继续遍历
             */
            $nodeArray = $nextNodeArray;
            $depth++;
        }

        /**
         * @return
         */
        return $root;
    }
}



/**
 * @url http://127.0.0.1/leetcode/202312/2023.12.15.php
 */
$datas = [
    [2,3,5,8,13,21,34],
];

include_once dirname(__DIR__) . DIRECTORY_SEPARATOR ."xhprof.php";
$xhprof = new Xhprof();
foreach ($datas as $data){
    if(count($data) <= 20){
        var_dump($data);
    } else {
        var_dump(count($data));
    }

    $obj = new Solution();
    // $result = $obj->(...$data);
    $result = $obj->reverseOddLevels($xhprof->tree($data));
    // $result = $obj->($xhprof->listNode($data));
    // $result = $obj->find(...$data);
    var_dump($result);
    // if(count($result)<=20){
    //     var_dump($result);
    // } else {
    //     var_dump(count($result));
    // }
    echo str_repeat(PHP_EOL, 3);
    echo str_repeat("<br>", 3);
}

// foreach ($datas as $data){
//     $obj = new $data[0][0](...$data[1][0]);
//
//     for ($i=1; $i<count($data[0]); $i++){
//         $func = $data[0][$i];
//         $param = $data[1][$i];
//         $result = $obj->$func(...$param);
//
//         echo $data[0][$i] ."(\"". implode(",", $data[1][$i]) ."\") ";
//             if($result === true){
//                 echo "True";
//             } elseif($result === false) {
//                 echo "False";
//             } elseif($result === null) {
//                 echo "Null";
//             } elseif(is_array($result)) {
//                 var_dump($result);
//             } else {
//                 echo $result;
//             }
//         echo PHP_EOL;
//     }
//
//     echo str_repeat(PHP_EOL, 3);
// }
$xhprof->end();
